Algebraic on Magic Square of Odd Order n
نویسنده
چکیده
This paper aims to address the relation between a magic square of odd order n and a group, and their properties. By the modulo number n, we construct entries for each table from initial table of magic square with large number n. Generalization of the underlying idea is presented, we obtain unique group, and we also prove variants of the main results for magic cubes.
منابع مشابه
Numerical Enumeration of Greco-Latin Prime Order Associative Magic Squares
A magic square of order n consists of the numbers 1 to n placed such that the sum of each row, column and principal diagonal equals the magic sum n(n +1)/2. In addition, an odd ordered magic square is associative or self-complementary if diagonally opposite elements have the same sum (n +1)/2. The magic square is said to be regular Greco-Latin if it can be decomposed as a sum of a pair of Latin...
متن کاملMagic Knight's Tours in Higher Dimensions
A knight‟s tour on a board is a sequence of knight moves that visits each square exactly once. A knight‟s tour on a square board is called magic knight‟s tour if the sum of the numbers in each row and column is the same (magic constant). Knight‟s tour in higher dimensions (n > 3) is a new topic in the age-old world of knight‟s tours. In this paper, it has been proved that there can‟t be magic k...
متن کاملLinear Magic Rectangles
Our purpose is to introduce a linear-algebraic construction for magic rectangles of size pr × ps, where p is prime and 1 ≤ r ≤ s. For fixed p, r, and s, this method allows for the production of many different magic rectangles. It follows that, for many non-coprime dimensions, this construction will significantly augment the sparse collection of “known” magic rectangles. A magic rectangle of siz...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملConstructing all magic squares of order three
A magic square of order n is an n by n matrix with distinct nonnegative integer entries such that every row sum, column sum, and (two) diagonal sums equals to the same number m, the magic number. Adding 1 to every entry will give us a traditional magic square of positive integers. A magic square is pure if the entries are the consecutive numbers from 0 to n − 1, and hence it has magic number 3 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1207.5117 شماره
صفحات -
تاریخ انتشار 2012